Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
نویسندگان
چکیده
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on bracketing and on recent results on randomized roundings respecting hard constraints. It is structurally much simpler than the previous algorithm presented for this problem in [B. Doerr, M. Gnewuch, A. Srivastav. Bounds and constructions for the star discrepancy via δ-covers. J. Complexity, 21:691–709, 2005]. Besides leading to better theoretical run time bounds, our approach also can be implemented with reasonable effort.
منابع مشابه
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respecting hard constraints and their derandomization. It is structurally much simpler than a previous algorithm presented for this problem in [B. Doerr, M. Gnewuch, A. Srivastav, J. Complexity, 21:691– 709, 2005]. Besides lead...
متن کاملImplementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples
In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Monte Carlo Methods Appl., 14:129–149, 2008], a component-by-component (CBC) approach to generate small low-discrepancy samples was proposed and analyzed. The method is based on randomized rounding satisfying hard constraints and its derandomization. In this paper we discuss how to implement the algorithm and present first numerical exper...
متن کاملConstruction of Minimal Bracketing Covers for Rectangles
We construct explicit δ-bracketing covers with minimal cardinality for the set system of (anchored) rectangles in the two dimensional unit cube. More precisely, the cardinality of these δ-bracketing covers are bounded from above by δ−2+o(δ−2). A lower bound for the cardinality of arbitrary δ-bracketing covers for d-dimensional anchored boxes from [M. Gnewuch, Bracketing numbers for axis-paralle...
متن کاملBounds and constructions for the star-discrepancy via ?-covers
For numerical integration in higher dimensions, bounds for the star-discrepancy with polynomial dependence on the dimension d are desirable. Furthermore, it is still a great challenge to give construction methods for lowdiscrepancy point sets. In this paper we give upper bounds for the star-discrepancy and its inverse for subsets of the d-dimensional unit cube. They improve known results. In pa...
متن کاملBracketing numbers for axis-parallel boxes and applications to geometric discrepancy
In the first part of this paper we derive lower bounds and constructive upper bounds for the bracketing numbers of anchored and unanchored axis-parallel boxes in the d-dimensional unit cube. In the second part we apply these results to geometric discrepancy. We derive upper bounds for the inverse of the star and the extreme discrepancy with explicitly given small constants and an optimal depend...
متن کامل